脉冲追赶式同步扫描下双基地雷达目标分辨力分析

脉冲追赶式同步扫描过程中,双基地雷达的目标分辨力不仅与雷达参数有关,而且还与脉冲追赶进程密切相关.分析了双基地雷达距离、角度和多普勒分辨力的影响因素,并对其在脉冲追赶情况下的变化规律进行分析,结果表明在每一脉冲追赶扫描周期内,双基地雷达的距离分辨力和多普勒分辨力不断提高,而角度分辨力则有所下降.     

用于自适应阵超角分辨的非均匀线阵设计问题

文中讨论了非均匀线阵自适应超角分辨问题,证明了在入射场条件一定的情况下,特征矢量角谱性能完全由阵列因子决定。通过分析与仿真,说明最小冗余阵(LMR) 是一种性能优良的超角分辨阵。并讨论了非均匀线阵存在的栅瓣问题,给出避免栅瓣的单位间距的上限公式。     

低分辨雷达基于波形特征的飞机架次判别方法

通过分析低分辨雷达飞机目标回波波形,提取出低分辨雷达飞机目标架次可资分类的特征参数作为飞机目标架次判别的特征向量。最后,采用模糊极大极小神经网络作为分类器,在低分辨雷达目标识别样机系统对机群目标进行分类识别试验中,验证了所提取特征的有效性。     

ENO格式应用分析

对一类高阶、高分辨率的ENO格式进行了较为详细的讨论。通过一些典型算例的应用和同常用TVD类型格式的比较 ,说明了在计算中采用高阶格式分辨复杂流动结构的优越性。在对格式应用分析的基础上 ,指出了格式应用中需注意的问题。通过定量分析说明 ,高阶ENO格式在计算中 ,不但能够减少网格规模 ,而且能够明显提高计算物理量 ,特别是其导数的计算精度     

一种基于Mellin变换的水声宽带相关模糊函数的快速算法

提出了一种基于Mellin 变换的快速算法,其特点是在给定的某一时刻得到不同尺度下的变换结果,算法的运算量与待分析的时延成正比,而在固定时刻下的运算量为两个2M点的FFT和一次2M点复数乘法(M为待分析的尺度的个数).该算法的优点是实时性好,且适合于水声信号领域尺度跨度小、尺度分析较细的特点,并给出了与直接法、CZT法的比较结果.     

New heuristic methods for the capacitated multi‐facility Weber problem

In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?_p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006     

基于匈牙利算法求解的火力分配问题

匈牙利算法是求解指派问题的一个很好的算法,但一般情况下,火力分配问题的数学模型不具备指派问题的模型形式.针对目标函数是线性或非线性的一类火力分配问题,提出了虚拟火力单位或目标的方法,将问题转化为能够用匈牙利算法求解的指派问题,该方法简单、易于计算,有很高的应用价值.     

大整数乘除运算在PC机上的实现

大整数在要求高精度的应用中非常有用.特别是大质数和一般大整数有一个极为重要的应用,就是关于计算机数据加密.在计算机数据加密技术中,常会遇到大整数的算术运算问题.由于所使用的机器和所用语言的限制,大整数的"乘""模"两种运算很难运用高级语言中的"乘""除"运算.提出了一种逐位存储、按字节运算的方法,并用C 实现了大整数的十进制乘除法运算,之后将提出的算法与类似算法的时间复杂度进行了比较,最后给出了算法的运行时间.     

Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems

Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017